#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const int N = 100005;
int n, a[N], cnt[N];
int main() {
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]), cnt[a[i]]++;
    int lst = 0;
    for (int i = 100000; i >= 1; i--) {
        lst -= min(lst, cnt[i]);
        lst += cnt[i];
    }
    printf("%d\n", lst);
    return 0;
}